Nancy Lynch Location - Free Routing Readings :
نویسنده
چکیده
Today’s material is based on three papers, which describe related routing methods. All of these methods proceed by defining virtual coordinates for the nodes, which are approximations to real Euclidean coordinates but are not actually Euclidean coordinates. These virtual coordinates are defined by means of hop-count distances from certain “landmark” (or “beacon”, or “perimeter”) nodes. The nodes are not assumed to have GPS, or other sources of real coordinates—except possibly for the special perimeter nodes. Once the coordinates are defined, they are used for routing in simple greedy-style algorithms: keep forwarding the packet in the direction of the (virtual) coordinates of the destination.
منابع مشابه
Compulsory Protocols 1.1 Overview
Readings: Compulsory protocols H̄atzis, Pentaris, Spirakis, Tampakas, Tan. Fundamental control algorithms in mobile networks. Chatzigiannakis, Nikoletseas, Spirakis. On the average and worse-case efficiency of some new distributed communication and control algorithms for ad hoc networks. Chatzigiannakis, Nikoletseas, Spirakis. An efficient communication strategy for ad-hoc mobile networks. Chatz...
متن کاملPoint-to-point Routing Readings: Point-to-point Message Routing: (optional) Brad Karp's Powerpoint Slides on Multi-hop Wireless Networks Johnson, Maltz: Dynamic Source Routing (dsr) Hu, Johnson: Caching Strategies for On-demand Routing Protocols
Next time, we’ll continue with routing: Perkins, Royer: Ad hoc on-demand distance-vector routing (AODV) Chen, Murphy: Enabling disconnected transitive communication in mobile ad hoc networks Link-reversal algorithms: Gafni, Bertsekas: Distributed algorithms for generating loop-free routes in networks with frequently changing topology Park, Corson: A highly adaptive distributed routing algorithm...
متن کاملSelf-stabilization and Virtual Node Layer Emulations
We present formal definitions of stabilization for the Timed I/O Automata (TIOA) framework, and of emulation for the timed Virtual Stationary Automata programming abstraction layer, which consists of mobile clients, virtual timed machines called virtual stationary automata (VSAs), and a local broadcast service connecting VSAs and mobile clients. We then describe what it means for mobile nodes w...
متن کاملSelf-Stabilizing Message Routing in Mobile ad hoc Networks
We present a self-stabilizing algorithm for routing messages between arbitrary pairs of nodes in a mobile ad hoc network. Our algorithm assumes the availability of a reliable GPS service, which supplies mobile nodes with accurate information about real time and about their own geographical locations. The GPS service provides an external, shared source of consistency for mobile nodes, allowing t...
متن کاملVirtual stationary timed automata for mobile networks
In this thesis, we formally define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs), and a communication service connecting VSAs and client nodes. The VSAs are located at prespecified regions that tile the plane, defining a static virtual...
متن کامل